Adaptive Fault-Tolerant Wormhole Routing Algorithms for Hypercube and Mesh Interconnection
نویسنده
چکیده
In this paper, we present adaptive fault-tolerant deadlock-free routing algorithms for hypercubes and meshes by using only 3 virtual channels and 2 virtual channels respectively. Based on the concept of unsafe nodes, we design a routing algorithm for hypercubes that can tolerate at least n 1 node faults and can route a message via a path of length no more than the Hamming distance between the source and destination plus four. We also develop a routing algorithm for meshes that can tolerate any block faults, as long as the distance between any two nodes in di erent faulty blocks is at least 2 in each dimension.
منابع مشابه
Adaptive Algorithms for Wormhole-Routed Single-Port Mesh- Hypercube Network
In this research, adaptive wormhole routing algorithms are proposed. The algorithms presented for both unicast and multicast communication for single-port Mesh Hypercube (MH) network. MH introduced as a new interconnection network for parallel systems. The basic structure for it is a blend of both mesh and hypercube networks. It combines the desirable features of both the hypercube and the mesh...
متن کاملAn Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes
The concept af virtual channels is extended to multiple, virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are possible and any routing function must use only those connections defined by it. Virtual interconnection networks allowing adaptive, deadlock-free rou...
متن کاملKIM and HAN : FAULT - TOLERANT ADAPTIVE WORMHOLE ROUTING IN 2 D MESH
A fault-tolerant wormhole routing algorithm on meshconnected processors is proposed. The proposed algorithm is based on the solid fault model and allows the fault polygons to be overlapped. The algorithm compares the position of fault region relative to current channel with the fault direction eld of a misrouted message to route around overlapped fault polygons. A node deactivating algorithm to...
متن کاملA Case Study of Fault Tolerant Routing Mechanism for Torus Embedded Hypercube Interconnection Network for Parallel Architecture
This paper describes a fault-tolerant routing mechanism to facilitate data routing in Torus embedded hypercube interconnection network subject to node failures in parallel computing. It is shown that by only using feasible paths routing can be substantially simplified. Though there are algorithms for fault tolerant communication in torus and hypercube networks, there exits no efficient algorith...
متن کاملA Fault-Tolerant Deadlock-Free Multicast Algorithm for Wormhole Routed Hypercubes
In this paper, we propose a novel fault-tolerant multicast algorithm for n-dimensional wormhole routed hypercubes. The multicast algorithm will remain functional if the number of faulty nodes in an n-dimensional hypercube is less than n. Multicast is the delivery of the same message from one source node to an arbitrary number of destination nodes. Recently, wormhole routing has become one of th...
متن کامل